Handbook of Discrete and Combinatorial Mathematics

Biographies

The Maximum Clique Problem Handbook Of Combinatorial Optimization

The maximum clique problem (MCP) is to determine a sub graph of maximum cardinality. A clique is a The corresponding optimization problem i.e. finding the maximum Maximum Clique Problem. in Handbook of Combinatorial. Common theme of every optimization problem: of semidefinite programming, A module on combinatorial optimization, Selected topics: The largest clique (i.e., complete subgraph)! In “...

Graph Theory

Course number: 0366.3267. When and where: Wednesdays 15-18, Ornstein 111. Prospective audience: the course is intended for second and third year undergraduate students in Mathematics or Computer Science. Prerequisites: first year courses in mathematics, most notably Discrete Mathematics or Introduction to Combinatorics. Requirements and grade: Homeworks will be given once every two-three weeks;...

Combinatorics on Words

Words (strings of symbols) are fundamental in computer processing. Indeed, each bit of data processed by a computer is a string, and nearly all computer software use algorithms on strings. There are also abundant supply of applications of these algorithms in other areas such as data compression, DNA sequence analysis, computer graphics, cryptography, and so on. Combinatorics on words belongs to...

What is a matroid? Theory and Applications, from the ground up

Gian-Carlo Rota said that “Anyone who has worked with matroids has come away with the conviction that matroids are one of the richest and most useful ideas of our day.” [20] Hassler Whitney introduced the theory of matroids in 1935 and developed a striking number of their basic properties as well as different ways to formulate the notion of a matroid. As more and more connections between matroi...